On the universal embedding of the near hexagon related to the extended ternary Golay code
نویسنده
چکیده
Let E1 be the near hexagon on 729 points related to the extended ternary Golay code. We prove in an entirely geometricway that the generating and embedding ranks ofE1 are equal to 24. We also study the structure of the universal embeddinge of E1. More precisely, we consider several nice subgeometries A of E1 and determine which kind of embeddingeA is, whereeA is the embedding of A induced bye. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
Golay Codes
We discuss a specific type of error-control coding using Golay codes. First we introduce the basics of coding. Then we discuss the Golay code in binary form, extended binary form, and ternary form.
متن کاملYet another approach to the extended ternary Golay code
A new proof of the uniqueness and of the existence of the extended ternary Golay code is presented. The proof connects the code to the projective plane of order 3 and is of an elementary nature. The available proofs of the uniqueness of the extended ternary Golay code [2,7] are much more complicated than the standard corresponding proof in the binary case [2]. The prevailing opinion seems to be...
متن کاملThe poset structures admitting the extended binary Golay code to be a perfect code
Brualdi et al. [Codes with a poset metric, Discrete Math. 147 (1995) 57–72] introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Golay code to be a 4-error-correcting perfect P-code. In this paper we classify all of the poset structures which admit the extended binary Golay code to be a 4-error-correcting perfect P-code, and show that th...
متن کاملImplementation of Effective Error Correction Architecture for (24,12) Extended Golay Code
With the increase in the technological advancements we are now capable of designing and using high speed communication systems and memory systems with very huge capacities. All these systems work on binary data and there is a great need to protect this information from being corrupted for which we are now using Error Correcting Codes (ECCs). The (24,12) Extended Golay Code is one of the widely ...
متن کاملChained Successive Cancellation Decoding of the Extended Golay code
The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation decoding algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012